A hybrid algorithm between branch-and-bound and outer approximation for Mixed Integer Nonlinear Programming
نویسندگان
چکیده
In this work, we present a new hybrid algorithm for convex Mixed Integer Nonlinear Programming combining branch-and-bound and outer approximation algorithms in an e ective and e cient way.
منابع مشابه
Predictive Control of Nonlinear Hybrid Systems Using Generalized Outer Approximation
This paper presents an efficient optimization algorithm for mixed integer nonlinear programming (MINLP) problem resulting from multiple partially linearized (MPL) model based control of nonlinear hybrid dynamical system (NHDS). The algorithm uses structural information of the canonical MPL framework and derives comparatively easier quadratic programming (QP) primal problem as well as an MILP ma...
متن کاملAn algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software for solving large-scale problems. Moreover, both fundamental building blocks, namely mixed integer linear programming and nonlinear programming, have seen considerable and steady progress in recent years. Wishing to exp...
متن کاملOPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT
Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In this paper, stochastic dyn...
متن کاملAn Outer Approximation based Branch and Cut Algorithm for convex 0-1 MINLP problems
A branch and cut algorithm is developed for solving 0-1 MINLP problems. The algorithm integrates Branch and Bound, Outer Approximation and Gomory Cutting Planes. Only the initial Mixed Integer Linear Programming (MILP) master problem is considered. At integer solutions Nonlinear Programming (NLP) problems are solved, using a primal-dual interior point algorithm. The objective and constraints ar...
متن کاملA Computational Comparison of Branch and Bound and Outer Approximation Algorithms for Mixed Integer Nonlinear Programs
In this paper we compare the performance of two codes for convex mixed integer nonlinear programs on a number of test problems The rst code uses a branch and bound algorithm The second code is a commer cially available implementation of an outer approximation algorithm The comparison demonstrates that both approaches are generally capable of solving the test problems However there are signi can...
متن کامل